On p-reducibility of numerations
نویسندگان
چکیده
منابع مشابه
On reducibility of weighted composition operators
In this paper, we study two types of the reducing subspaces for the weighted composition operator $W: frightarrow ucdot fcirc varphi$ on $L^2(Sigma)$. A necessary and sufficient condition is given for $W$ to possess the reducing subspaces of the form $L^2(Sigma_B)$ where $Bin Sigma_{sigma(u)}$. Moreover, we pose some necessary and some sufficient conditions under which the subspaces of the form...
متن کاملReducibility Classes of P-Selective Sets
A set is P-selective (Selman, 1979) if there is a polynomial-time semidecision algorithm for the set-an algorithm that given any two strings decides which is " more likely " to be in the set. This paper establishes a strict hierarchy among the various reductions and equivalences to P-selective sets. Given the large number of important problems that do not appear to have easy solutions, research...
متن کاملREDUCIBILITY OF SOME INDUCED REPRESENTATIONS OF p-ADIC UNITARY GROUPS
In this paper we study reducibility of those representations of quasi-split unitary p-adic groups which are parabolically induced from supercuspidal representations of general linear groups. For a supercuspidal representation associated via Howe’s construction to an admissible character, we show that in many cases a criterion of Goldberg for reducibility of the induced representation reduces to...
متن کاملOn ~-reducibility versus Polynomial Time Many-one Reducibility*
We prove that each element of a class of f,anctions (denoted by NPCtP), whose graphs can be accepted in nondeterministic polynomial time, can be evaluated in deterministic polynomial time if and only if '/-reducibility is equivalent to polynomial time many-one reducibility. We also modify the proof technique used to obtain part of this result to obtain the stronger result that if every ,/-reduc...
متن کاملOn reducibility of n-quasigroups
If the arity of a maximal irreducible retractof an n-quasigroup M belongs to {3, . . . , n − 3}, then M is reducible.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 1993
ISSN: 0168-0072
DOI: 10.1016/0168-0072(93)90208-u